منابع مشابه
Quasi-Modal Lattices
We introduce the class of bounded distributive lattices with two operators, and ∇, the first between the lattice and the set of its ideals, and the second between the lattice and the set of its filters. The results presented can be understood as a generalization of the results obtained by S. Celani.
متن کاملAnalogizing Hutton's quasi-uniformities for complete lattices and extending Shi's quasi-uniformities to closed set lattices
This paper gives analogies of Hutton’s quasi-uniformities for complete lattices and extensions of Shi’s pointwise quasi-uniformities to closed set lattices.CLGOH denotes the category of all complete lattices with generalized order homomorphisms asmorphisms and CSL the category of all closed set lattices.HQUnif and SPQUnif denote the categories of Hutton quasi-uniform spaces on complete lattices...
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملIsodual Reduction of Lattices
We define a new notion of a reduced lattice, based on a quantity introduced in the LLL paper. We show that lattices reduced in this sense are simultaneously reduced in both their primal and dual. We show that the definition applies naturally to blocks, and therefore gives a new hierarchy of polynomial time algorithms for lattice reduction with fixed blocksize. We compare this hierarchy of algor...
متن کاملSubtyping Constraints in Quasi-lattices
In this report, we show the decidability and NP-completeness of the satisfiability problem for non-structural subtyping constraints in quasi-lattices. This problem, first introduced by Smolka in 1989, is important for the typing of logic and functional languages. The decidability result is obtained by generalizing Trifonov and Smith’s algorithm over lattices, to the case of quasi-lattices. Simi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics Trends and Technology
سال: 2019
ISSN: 2231-5373
DOI: 10.14445/22315373/ijmtt-v65i4p506